Type Inference of Simulink Hierarchical Block Diagrams in Isabelle
نویسندگان
چکیده
Simulink is a de-facto industrial standard for the design of embedded systems. In previous work, we developed a compositional analysis framework for Simulink models in Isabelle – the Refinement Calculus of Reactive Systems (RCRS), which allows checking compatibility and substitutability of components. However, standard type checking was not considered in that work. In this paper we present a method for the type inference of hierarchical block diagrams using the Isabelle theorem prover. A Simulink diagram is translated into an (RCRS) Isabelle theory. Then the Isabelle’s powerful type inference mechanism is used to infer the types of the diagram based on the types of the basic blocks. One of the aims is to handle formally as many diagrams as possible. In particular, we want to be able to handle even those diagrams that may have typing ambiguities, provided that they are accepted by Simulink. This method is implemented in our toolset that translates Simulink diagrams into Isabelle theories and simplifies them. We evaluate our technique on several case studies, most notably, an automotive fuel control system benchmark provided by Toyota.
منابع مشابه
Compositional Semantics and Analysis of Hierarchical Block Diagrams
We present a compositional semantics and analysis framework for hierarchical block diagrams (HBDs) in terms of atomic and composite predicate transformers. Our framework consists of two components: (1) a compiler that translates Simulink HBDs into an algebra of transformers composed in series, in parallel, and in feedback; (2) an implementation of the theory of transformers and static analysis ...
متن کاملTranslating Hierarchical Block Diagrams into Composite Predicate Transformers
Simulink is the de facto industrial standard for designing embedded control systems. When dealing with the formal verification of Simulink models, we face the problem of translating the graphical language of Simulink, namely, hierarchical block diagrams (HBDs), into a formalism suitable for verification. In this paper, we study the translation of HBDs into the compositional refinement calculus ...
متن کاملA Nondeterministic and Abstract Algorithm for Translating Hierarchical Block Diagrams
In this paper we introduce a nondeterministic algorithm for translating hierarchical block diagrams (HBDs) into an abstract algebra of components with three basic composition operations (serial, parallel, and feedback) and with three constants (split, switch, and sink). We prove that despite its internal nondeterminism, the result of the algorithm is deterministic, meaning that all possible alg...
متن کاملModular Code Generation from Synchronous Block Diagrams
We study modular, automatic code generation from hierarchical block diagrams with synchronous semantics. Such diagrams are the fundamental model behind widespread tools such as Simulink and SCADE. Modularity means code is generated for a given composite block independently from context, that is, without knowing in which diagrams this block is going to be used. This can be achieved by abstractin...
متن کاملPolychronous Interpretation of Synoptic, a Domain Specific Modeling Language for Embedded Flight-Software
The SPaCIFY project, which aims at bringing advances in MDE to the satellite flight software industry, advocates a top-down approach built on a domain-specific modeling language named Synoptic. In line with previous approaches to real-time modeling such as Statecharts and Simulink, Synoptic features hierarchical decomposition of application and control modules in synchronous block diagrams and ...
متن کامل